Ramsey Goodness and Beyond

In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the Szemeredi regularity lemma, embedding of sparse graphs, Turan type stability, and other structural results. We give exact Ramsey numbers for various classes of graphs, solving all but one of the Burr-Erdos problems.Comment: A new reference is adde

2012 ACCF/AHA/ACP/AATS/PCNA/SCAI/STS guideline for the diagnosis and management of patients with stable ischemic heart disease

The recommendations listed in this document are, whenever possible, evidence based. An extensive evidence review was conducted as the document was compiled through December 2008. Repeated literature searches were performed by the guideline development staff and writing committee members as new issues were considered. New clinical trials published in peer-reviewed journals and articles through December 2011 were also reviewed and incorporated when relevant. Furthermore, because of the extended development time period for this guideline, peer review comments indicated that the sections focused on imaging technologies required additional updating, which occurred during 2011. Therefore, the evidence review for the imaging sections includes published literature through December 2011

A note on Ramsey numbers for books

The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm, Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ Ḡ for every graph G of order r. We prove that there exists a positive constant c such that r(Bm, Bn)= 2n + 3 for all n ≥ cm. Our proof is based mainly on counting; we also use a result of Andrásfai, Erdos, and Sós stating that triangle-free graphs of order n and minimum degree greater than 2n/5 are bipartite. © 2005 Wiley Periodicals, Inc

On the logistic midrange

It is well-known that for a large family of distributions, the sample midrange is asymptotically logistic. In this article, the logistic midrange is closely examined. Its distribution function is derived using Dixon\u27s formula (Bailey (1935, Generalized Hypergeometric Series, Cambridge University Press, p. 13)) for the generalized hypergeometric function with unit argument, together with appropriate techniques for the inversion of (bilateral) Laplace transforms. Several relationships in distribution are established between the midrange and sample median of the logistic and Laplace random variables. Possible applications in testing for outliers are also discussed. © 1987 Kluwer Academic Publishers

Representação: palavras, instituições e idéias Representation: words, institutions and ideas

Em argumento reconstrutivo, baseado em abordagem própria à filosofia da linguagem, a autora lança mão das transformações seculares nos usos da fala, nas cristalizações ideológicas no plano da filosofia política e nas práticas históricas de representação política para mostrar a emergência das feições distintivas da representação moderna.<br>In a reconstructive analysis, based upon the philosophy of language, the author handles the secular transformations in speech, ideological crystallizations within the tradition of political philosophy and the historical practices of political representation in order to show the coming up of the distinctive features of modern representation